منابع مشابه
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query graph, from a large set of graphs. Considering the problem of testing subgraph isomorphism is generally NP-hard, most of the existing techniques are based on the framework of filtering-and-verification to reduce the p...
متن کاملAn algorithm using length-r paths to approximate subgraph isomorphism
The ‘LeRP’ algorithm approximates subgraph isomorphism for attributed graphs based on counts of Length-R Paths. The algorithm provides a good approximation to the maximal isomorphic subgraph. The basic approach of the LeRP algorithm differs fundamentally from other methods. When comparing structural similarity LeRP uses a neighborhood of nodes that varies in size dynamically. This approach prov...
متن کاملFiltering for Subgraph Isomorphism
A subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph iso...
متن کاملA New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
In this paper, we propose a new algorithm for error-correcting subgraph isomorphism detection from a set of model graphs to an unknown input graph. The algorithm is based on a compact representation of the model graphs. This representation is derived from the set of model graphs in an off-line preprocessing step. The main advantage of the proposed representation is that common subgraphs of diff...
متن کاملLower Bounds for Subgraph Isomorphism
We consider the computational complexity of determining whether an Erdős-Rényi random graph contains a subgraph isomorphic to a fixed pattern, such as a clique or cycle of constant size. We give an overview of unconditional lower bounds for this problem, focusing on circuits and formulas in the AC 0 and monotone settings. 1 Background and preliminaries The subgraph isomorphism problem is the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1976
ISSN: 0004-5411,1557-735X
DOI: 10.1145/321921.321925